Parametric solutions to the generalized discrete Sylvester matrix equation MXN - X = TY and their applications

نویسندگان

  • Bin Zhou
  • Guang-Ren Duan
چکیده

In this paper, an explicit, analytical and complete solution to the generalized discrete Sylvester matrix equation M X N − X = T Y which is closely related with several types of matrix equations in control theory is obtained. The proposed solution has a neat and elegant form in terms of the Krylov matrix, a block Hankel matrix and an observability matrix. Based on the proposed solution, an explicit solution to the general discrete Lyapunov matrix equation is also derived. As an application, the parametric pole assignment for descriptor linear systems by proportional-plus-derivative state feedback is considered. The results presented here are parallel to our earlier results on the generalized Sylvester matrix equation AX − X F = BY .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solutions to the generalized Sylvester matrix equations by a singular value decomposition

In this paper, solutions to the generalized Sylvester matrix equations AX−XF = BY and MXN−X = TY with A, M ∈ Rn×n, B, T ∈ Rn×r, F, N ∈ Rp×p and the matrices N, F being in companion form, are established by a singular value decomposition of a matrix with dimensions n × (n + pr). The algorithm proposed in this paper for the euqation AX − XF = BY does not require the controllability of matrix pair...

متن کامل

A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

متن کامل

Ranks of the common solution to some quaternion matrix equations with applications

We derive the formulas of the maximal andminimal ranks of four real matrices $X_{1},X_{2},X_{3}$ and $X_{4}$in common solution $X=X_{1}+X_{2}i+X_{3}j+X_{4}k$ to quaternionmatrix equations $A_{1}X=C_{1},XB_{2}=C_{2},A_{3}XB_{3}=C_{3}$. Asapplications, we establish necessary and sufficient conditions forthe existence of the common real and complex solutions to the matrixequations. We give the exp...

متن کامل

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

The Projected Generalized Sylvester Equations: Numerical Solution and Applications

In this paper we consider the numerical solution of large-scale projected generalized continuous-time and discrete-time Sylvester equations with low-rank right-hand sides. First, we present the results on the sufficient conditions for the existence, uniqueness, and analytic formula of the solutions of these equations. Second, we review the low-rank alternating direction implicit method and the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IMA J. Math. Control & Information

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2009